Clustering-based solution approach for a capacitated lot-sizing problem on parallel machines with sequence-dependent setups*

This paper studies an industrial lot-sizing and scheduling problem coming from the food-industry that extends multi-item capacitated includes lost sales, overtimes, safety stock non-uniform sequence-dependent setups on parallel machines. We introduce two different formulations adapt well-known Relax-and-Fix Fix-and-Optimise heuristics in order to quickly obtain feasible solutions large instances. The complexity of our prevents procedure good within time allocated by practitioners real-life cases, hence we propose use a clustering approach approximate setup times. resulting is significantly smaller solve experimental results suggest this transformation effectively improves found In particular, combination method turns out be promising given time-limit.